On Linear-Time Algorithms for the Continuous Quadratic Knapsack Problem
نویسندگان
چکیده
منابع مشابه
A Newton's method for the continuous quadratic knapsack problem
We introduce a new efficient method to solve the continuous quadratic knapsack problem. This is a highly structured quadratic program that appears in different contexts. The method converges after O(n) iterations with overall arithmetic complexity O(n2). Numerical experiments show that in practice the method converges in a small number of iterations with overall linear complexity, and is faster...
متن کاملExact Algorithms for the Quadratic Linear Ordering Problem
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear arrangement. These problems have important applications in, e.g., automatic graph drawing and computational biology. We present a new polyhedral approach to the quadratic linear ordering problem that is based on a li...
متن کاملExact Solution of the Quadratic Knapsack Problem
The Quadratic Knapsack Problem (QKP) calls for maximizing a quadratic objective function subject to a knapsack constraint, where all coeecients are assumed to be nonnegative and all variables are binary. The problem has applications in location and hydrology, and generalizes the problem of checking whether a graph contains a clique of a given size. We propose an exact branch-and-bound algorithm...
متن کاملThe Separable Convex Quadratic Knapsack Problem
This paper considers the problem of minimizing a convex, separable quadratic function subject to a knapsack constraint and a box constraint. An algorithm called NAPHEAP is developed for solving this problem. The algorithm solves the Karush-Kuhn-Tucker system using a starting guess to the optimal Lagrange multiplier and updating the guess monotonically in the direction of the solution. The start...
متن کاملApproximation of the Quadratic Knapsack Problem
We study the approximability of the classical quadratic knapsack problem (QKP) on special graph classes. In this case the quadratic terms of the objective function are not given for each pair of knapsack items. Instead an edge weighted graph G = (V, E) whose vertices represent the knapsack items induces a quadratic profit p ij for the items i and j whenever they are adjacent in G (i.e (i, j) ∈ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2007
ISSN: 0022-3239,1573-2878
DOI: 10.1007/s10957-007-9259-0